Asymptotics of the Lebesgue constants for bivariate approximation processes
نویسندگان
چکیده
• Asymptotics of the Lebesgue constant for Lagrange interpolation based on Lissajous-Chebyshev node points. partial sums Fourier series generated by anisotropically dilated rhombus. Formula Dirichlet kernel with frequencies in In this paper asymptotic formulas are given constants three special approximation processes related to ? 1 -partial series. particular, we consider polynomials points, rhombus, and corresponding discrete sums.
منابع مشابه
A Formula for the Bivariate Map Asymptotics Constants in terms of the Univariate Map Asymptotics Constants
The parameters tg, pg, tg(r) and pg(r) appear in the asymptotics for a variety of maps on surfaces and embeddable graphs. In this paper we express tg(r) in terms of tg and pg(r) in terms of pg.
متن کاملLebesgue constants for the weak greedy algorithm
We estimate the Lebesgue constants for the weak thresholding greedy algorithm in a Banach space relative to a biorthogonal system. The estimates involve the weakness (relaxation) parameter of the algorithm, as well as properties of the basis, such as its quasi-greedy constant and democracy function.
متن کاملA weak approximation for the Extrema's distributions of Levy processes
Suppose that $X_{t}$ is a one-dimensional and real-valued L'evy process started from $X_0=0$, which ({bf 1}) its nonnegative jumps measure $nu$ satisfying $int_{Bbb R}min{1,x^2}nu(dx)
متن کاملLebesgue Constants and Fourier Transform
This is an attempt of a comprehensive survey of the results in which estimates of the norms of linear means of multiple Fourier series, the Lebesgue constants, are obtained by means of estimating the Fourier transform of a function generating such a method. Only few proofs are given in order to illustrate a general idea of techniques applied. Among the results are well known elsewhere as well a...
متن کاملLebesgue constants in polynomial interpolation
Lagrange interpolation is a classical method for approximating a continuous function by a polynomial that agrees with the function at a number of chosen points (the “nodes”). However, the accuracy of the approximation is greatly influenced by the location of these nodes. Now, a useful way to measure a given set of nodes to determine whether its Lagrange polynomials are likely to provide good ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2021
ISSN: ['1873-5649', '0096-3003']
DOI: https://doi.org/10.1016/j.amc.2021.126192